Improving Performance and Routability Estimation in MCM Placement

نویسندگان

  • J. Y. Cho
  • Sung Kyun Kwan
چکیده

Placement of multiple dies on an MCM or high-performance VLSI substrate is a non-trivial task in which multiple criteria need to be considered simultaneously to obtain a true multi-objective optimization. Unfortunately, the exact physical attributes of a design are not known in the placement step until the entire design process is carried out. When the performance issues are considered, crosstalk noise constraints in the form of net separation and via constraint become important. In this paper, for better performance and wirability estimation during placement for MCMs, several performance constraints are taken into account simultaneously. A graph-based wirabil-ity estimation along with the Genetic placement optimization technique is proposed to minimize crosstalk, crossings, wirelength and the number of layers. Our work is signiicant since it is the rst attempt at bringing the crosstalk and other performance issues into the placement domain.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving Performance and Routability Estimation in Deep-submicron Placement 1

Placement of multiple dies on an MCM or high-performance VLSI substrate is a non-trivial task in which multiple criteria need to be considered simultaneously to obtain a true multi-objective optimization. Unfortunately, the exact physical attributes of a design are not known in the placement step until the entire design process is carried out. When the performance issues are considered, crossta...

متن کامل

Fast and Incremental Routability Check of A Topological Routing Using a Cut-based Encoding

abstract Many performance-driven routing algorithms do not consider routability. Routing trees are built assuming that there are no other wires. The main reason for this is that it is NP-hard to guarantee routability. Even checking for routabil-ity is a time-consuming process. This limits the usefulness of many performance-driven routing algorithms because unroutable designs are useless. Previo...

متن کامل

RISA: Accurate and Efficient Placement Routability Modeling Chih-liang

The prevalence of net list synthesis took raises great concern on routability of cell placement created with state-of-the-art placement techniques. In this paper, an accurate and efiienr placement routability modeling technique is proposed and incorporated into the prevailing simulated annealing approach. This accurate and eficient modeling is based on the supply versus demand analysis of routi...

متن کامل

A Standard-Cell Placement Tool for Designs with High Row Utilization

In this paper we study the correlation between wirelength and routability for standard-cell placement problem, under the fixed-die place-androute environment. We present a placement tool with better routability for designs with high row utilization. Compared to a well-known industrial placement tool, our placer produces placements with equal or better routability, 13.2% better half-perimeter wi...

متن کامل

Frontier: A Fast Placement System for FPGAs

In this paper we describe Frontier, an FPGA placement system that uses design macro-blocks in conjuction with a series of placement algorithms to achieve highly-routable and high-performance layouts quickly. In the first stage of design placement, a macro-based floorplanner is used to quickly identify an initial layout based on inter-macro connectivity. Next, an FPGA routability metric, previou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007